Minimising the expected commute time

On minimising the maximum expected verification time

Electric Networks and Commute Time

The equivalence of random walks on weighted graphs with reversible Markov chains has long been known. Another such correspondence exists between electric networks and these random walks. Results in the language of random walks have analogues in the language of electric networks and visa versa. We outline this correspondence and describe how to translate several of the major terms of electric ne...

Minimising the time to a decision

Suppose we have three independent copies of a regular diffusion on [0,1] with absorbing boundaries. Of these diffusions, either at least two are absorbed at the upper boundary or at least two at the lower boundary. In this way, they determine a majority decision between 0 and 1. We show that the strategy that always runs the diffusion whose value is currently between the other two reveals the m...

Exploring Invariants & Patterns in Human Commute time

In everyday life, the process of commuting to work from home happens every now and then. And the research of commute characteristics is useful for urban function planning. For humans, the commute of an individual seems revealing no regular universal patterns, but it is true that people try to find a satisfactory state of life regarding commute issues. Commute time and distance are most importan...

Efficient large scale commute time embedding

Commute time embedding involves computing eigenfunctions of the graph Laplacian matrix. Spectral decomposition requires computational burden proportional to 3 ( ) O n , which may not be suitable for large scale dataset. This paper proposes computationally efficient commute time embedding by applying Nyström method to the normalized graph Laplacian. The performance of the proposed algorithms is ...